A Parallel Compact Hash Table
نویسندگان
چکیده
We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic regionbased locking scheme with only a fraction of the memory requirements of a regular hash table.
منابع مشابه
Fast and deterministic hash table lookup using discriminative bloom filters
Hash tables are widely used in network applications, as they can achieve O(1) query, insert, and delete operations at moderate loads. However, at high loads, collisions are prevalent in the table, which increases the access time and induces non-deterministic performance. Slow rates and non-determinism can considerably hurt the performance and scalability of hash tables in the multi-threaded par...
متن کاملA Concurrent Bidirectional Linear Probing Algorithm Towards a Concurrent Compact Hash Table
Hash tables are commonly used data structures for representing subsets of a large key universe. In these tables, the complete key is stored in order to resolve the item in case of a collision. Since the 1980’s, there are known techniques to reduce the used memory by only storing a part of the original key. However, there are no known concurrent implementations of these so-called compact hash ta...
متن کاملDesigning fast LTL model checking algorithms for many-core GPUs
Recent technological developments made various many-core hardware platforms widely accessible. These massively parallel architectures have been used to significantly accelerate many computation demanding tasks. In this paper we show how the algorithms for LTL model checking can be redesigned in order to accelerate LTL model checking on many-core GPU platforms. Our detailed experimental evaluati...
متن کاملFast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious array hash table. Although fast with strings, there is currently no information in the research literature on its performance with integer keys. More importantly, we do not know how efficient an integer-based array ha...
متن کاملMultiresolution Implicit Representation of 3D Objects
This paper presents a generic technique for converting any 3D object into an implicit representation, based on multiresolution implicit grids. A specific hash table structure is proposed, which permits compact storage as well as easy hierarchical evaluation of the object. Finally, a tessellator for these multiresolution implicit objects is presented, that takes advantage of the hash table struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011